Computing subset transversals in H-free graphs
نویسندگان
چکیده
We study the computational complexity of two well-known graph transversal problems, namely Subset Feedback Vertex Set and Odd Cycle Transversal, by restricting input to H-free graphs, that is, graphs do not contain some fixed H as an induced subgraph. By combining known new results, we determine both problems on for every except when H=sP1+P4 s≥1. As part our approach, introduce Cover problem prove it is polynomial-time solvable (sP1+P4)-free
منابع مشابه
Bounded transversals in multipartite graphs
Transversals in r-partite graphs with various properties are known to have many applications in graph theory and theoretical computer science. We investigate f -bounded transversals (or f -BT), that is, transversals whose connected components have order at most f . In some sense we search for the the sparsest f -BT-free graphs. We obtain estimates on the smallest maximum degree that 3-partite a...
متن کاملMaxCut in H-free graphs
For a graph G, let f(G) denote the maximum number of edges in a cut of G. For an integer m and for a fixed graph H, let f(m,H) denote the minimum possible cardinality of f(G), as G ranges over all graphs on m edges that contain no copy of H. In this paper we study this function for various graphs H. In particular we show that for any graph H obtained by connecting a single vertex to all vertice...
متن کاملTriangles in H-free graphs
For two graphs T and H and for an integer n, let ex(n, T,H) denote the maximum possible number of copies of T in an H-free graph on n vertices. The study of this function when T = K2 is a single edge is the main subject of extremal graph theory. In the present paper we investigate the general function, focusing on the case T = K3, which reveals several interesting phenomena. Three representativ...
متن کاملComputing shortest transversals of sets
Given a family of objecte in the plane, the line transversal problem is to compute a line that intersects every member of the family. In this paper we examine a variation of the line transversal problem that involves computing a shortest line segment that intersects every member of the family. In particular, we give O(nlogn) time algorithms for computing a shortest transversal of a family of n ...
متن کاملIndependent transversals in r-partite graphs
Let G(r, n) denote the set of all r-partite graphs consisting of n vertices in each partite class. An independent transversal of G ∈ G(r, n) is an independent set consisting of exactly one vertex from each vertex class. Let ∆(r, n) be the maximal integer such that every G ∈ G(r, n) with maximal degree less than ∆(r, n) contains an independent transversal. Let Cr = limn→∞ ∆(r,n) n . We establish...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.12.010